Space Lower Bounds for Online Pattern Matching
نویسندگان
چکیده
We present space lower bounds for online pattern matching under a number of different distance measures. Given a pattern of length m and a text that arrives one character at a time, the online pattern matching problem is to report the distance between the pattern and a sliding window of the text as soon as the new character arrives. We require that the correct answer is given at each position with constant probability. We give Ω(m) bit space lower bounds for L1, L2, L∞, Hamming, edit and swap distances as well as for any algorithm that computes the cross-correlation/convolution. We then show a dichotomy between distance functions that have wildcard-like properties and those that do not. In the former case which includes, as an example, pattern matching with character classes, we give Ω(m) bit space lower bounds. For other distance functions, we show that there exist space bounds of Ω(logm) and O(log m) bits. Finally we discuss space lower bounds for non-binary inputs and show how in some cases they can be improved.
منابع مشابه
The complexity of computation in bit streams
We revisit the complexity of online computation in the cell probe model. We consider a class of problems where we are first given a fixed pattern or vector F of n symbols and then one symbol arrives at a time in a stream. After each symbol has arrived we must output some function of F and the n-length suffix of the arriving stream. Cell probe bounds of Ω(δ lg n/w) have previously been shown for...
متن کاملPattern Matching in Multiple Streams
We investigate the problem of deterministic pattern matching in multiple streams. In this model, one symbol arrives at a time and is associated with one of s streaming texts. The task at each time step is to report if there is a new match between a fixed pattern of length m and a newly updated stream. As is usual in the streaming context, the goal is to use as little space as possible while sti...
متن کاملCell-Probe Lower Bounds for Bit Stream Computation
We revisit the complexity of online computation in the cell probe model. We consider a class of problems where we are first given a fixed pattern F of n symbols and then one symbol arrives at a time in a stream. After each symbol has arrived we must output some function of F and the n-length suffix of the arriving stream. Cell probe bounds of Ω(δ lgn/w) have previously been shown for both convo...
متن کاملData Structure Lower Bounds for Document Indexing Problems
We study data structure problems related to document indexing and pattern matching queries and our main contribution is to show that the pointer machine model of computation can be extremely useful in proving high and unconditional lower bounds that cannot be obtained in any other known model of computation with the current techniques. Often our lower bounds match the known space-query time tra...
متن کاملA o(n) -Competitive Deterministic Algorithm for Online Matching on a Line
Online matching on a line involves matching an online stream of items of various sizes to stored items of various sizes, with the objective of minimizing the average discrepancy in size between matched items. The best previously known upper and lower bounds on the optimal deterministic competitive ratio are linear in the number of items, and constant, respectively. We show that online matching ...
متن کامل